Reactive Preferential Structures and Nonmonotonic Consequence

نویسندگان

  • Dov M. Gabbay
  • Karl Schlechta
چکیده

We introduce Information Bearing Relation Systems (IBRS) as an abstraction of many logical systems. We then define a general semantics for IBRS, and show that a special case of IBRS generalizes in a very natural way preferential semantics and solves open representation problems for weak logical systems. This is possible, as we can ”break” the strong coherence properties of preferential structures by higher arrows, i.e. arrows, which do not go to points, but to arrows themselves.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Formula-Preferential Base for Paraconsistent and Plausible Reasoning Systems

We provide a general framework for constructing natural consequence relations for paraconsistent and plausible nonmonotonic reasoning. The framework is based on preferential systems whose preferences are based on the satisfaction of formulas in models. We show that these natural preferential systems that were originally designed for paraconsistent reasoning fulfill a key condition (stopperednes...

متن کامل

On Representation Theorems for Nonmonotonic Consequence Relations

One of the main tools in the study of nonmonotonic consequence relations is the representation of such relations in terms of preferential models. In this paper we give an unified and simpler framework to obtain such representation theorems.

متن کامل

Nonmonotonic Modes of Inference

In this paper we investigate nonmonotonic ‘modes of inference’. Our approach uses modal (conditional) logic to establish a uniform framework in which to study nonmonotonic consequence. We consider a particular mode of inference which employs a majority-based account of default reasoning—one which differs from the more familiar preferential accounts—and show how modal logic supplies a framework ...

متن کامل

A Unified View of Consequence Relation, Belief Revision and Conditional Logic

The notion of minimality is widely used in three different areas of Artificial Intelligence: non-monotonic reasoning, belief revision, and conditional reasoning. However, it is difficult for the readers of the literature in these areas to perceive the similarities clearly, because each formalization in those areas uses its own language sometimes without referring to other for-malizations. We de...

متن کامل

What Does a Conditional Knowledge Base Entail?

This paper presents a logical approach to nonmonotonic reasoning based on the notion of a nonmonotonic consequence relation A condi tional knowledge base consisting of a set of conditional assertions of the type if then represents the explicit defeasible knowledge an agent has about the way the world generally behaves We look for a plausible de nition of the set of all conditional assertions en...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Rew. Symb. Logic

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2009